Primal–dual algorithm for distributed constrained optimization
نویسندگان
چکیده
منابع مشابه
A non-heuristic distributed algorithm for non- convex constrained optimization
In this paper we introduce a discrete-time, distributed optimization algorithm executed by a set of agents whose interactions are subject to a communication graph. The algorithm can be applied to optimization problems where the cost function is expressed as a sum of functions, and where each function is associated to an agent. In addition, the agents can have equality constraints as well. The a...
متن کاملDistributed Random-Fixed Projected Algorithm for Constrained Optimization Over Digraphs
This paper is concerned with a constrained optimization problem over a directed graph (digraph) of nodes, in which the cost function is a sum of local objectives, and each node only knows its local objective and constraints. To collaboratively solve the optimization, most of the existing works require the interaction graph to be balanced or “doubly-stochastic”, which is quite restrictive and no...
متن کاملConstrained Optimization Evolutionary Algorithm
Constrained optimization evolutionary algorithm (COEA) is a mathematical programming problem frequently encountered in the field of engineering application. Solving constrained optimization problems by COEA has become an important research area of evolutionary computation in recent years. In this paper, the constrained optimization evolutionary algorithm is based on the quantum evolutionary alg...
متن کاملInexact{restoration Algorithm for Constrained Optimization
We introduce a new model algorithm for solving nonlinear programming problems. No slack variables are introduced for dealing with inequality constraints. Each iteration of the method proceeds in two phases. In the rst phase, feasibility of the current iterate is improved and in second phase the objective function value is reduced in an approximate feasible set. The point that results from the s...
متن کاملA hybrid algorithm for infinitely constrained optimization
In® nitely constrained (or semi-in® nite) optimization can be successfully used to solve a signi® cant variety of optimization-based engineering design problems. In this paper a new algorithm for the numerical global solution of nonlinear and nonconvex, in® nitely constrained problems is proposed. At the upper level this hybrid algorithm is a partially elitist genetic algorithm that uses, at th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Systems & Control Letters
سال: 2016
ISSN: 0167-6911
DOI: 10.1016/j.sysconle.2016.07.009